A Logic for Reasoning about Well-Founded Semantics: Preliminary Report

نویسندگان

  • Pedro Cabalar
  • Sergei Odintsov
  • David Pearce
چکیده

The paper presents a preliminary solution to a long-standing problem in the foundations of well-founded semantics for logic programs. The problem addressed is this: which logic can be considered adequate for well-founded semantics (WFS) in the sense that its minimal models (appropriately defined) coincide with the partial stable models of a logic program? We approach this problem by identifying the HT 2 frames previously proposed by Cabalar [4] to capture WFS as structures of a kind used by Dosen [5] to characterise a family of logics weaker than intuitionistic and minimal logic. We identify partial stable models as minimal models in this semantics and we axiomatise the resulting logic.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Non-monotonic Negation in Hybrid Probabilistic Logic Programs

In [23], a new Hybrid Probabilistic Logic Programs framework has been proposed, and a new semantics has been developed to enable encoding and reasoning about real-world applications. In this paper, the language of Hybrid Probabilistic Logic Programs framework of [23] is extended to allow non-monotonic negation, and two alternative semantics are defined: stable probabilistic model semantics and ...

متن کامل

Hybrid Probabilistic Logic Programs with Non-monotonic Negation

1 In [20], a new Hybrid Probabilistic Logic Programs framework is proposed, and a new semantics is developed to enable encoding and reasoning about real-world applications. In this paper, we extend the language of Hybrid Probabilistic Logic Programs framework in [20] to allow non-monotonic negation, and define two alternative semantics: stable probabilistic model semantics and probabilistic wel...

متن کامل

A Computational Logic Approach to the Abstract and the Social Case of the Selection Task

Previous results have shown that weak completion semantics based on three-valued Łukasiewicz logic can adequately represent and explain human behavior in the suppression task. Weak completion semantics corresponds to well-founded semantics for tight logic programs. In this paper we apply both semantics to the selection task – probably the most famous and best investigated research paradigm in t...

متن کامل

Reasoning about Stable Models (and other Unstable Semantics)

The well-founded semantics and stable model semantics have proven popular semantics for logic programs. However, these semantics (and others) are not directly amenable to logical reasoning since logically equivalent logic programs may have different stable or well-founded models. Many natural simplifications are not universally valid. Furthermore, in some semantics – including the stable model ...

متن کامل

Nonmonotonic Reasoning with Well Founded Semantics

Well Founded Semantics is adequate to capture nonmonotonic reasoning if we interpret the Well Founded model of a program P as a (possibly incomplete) view of the world. Thus the Well Founded model may be accepted to be a definite view of the world and the extended stable models as alternative enlarged consistent belief models an agent may have about the world. Our purpose is to exhibit a modula...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005